The Odyssey of Palazzolo: Public Rights Litigation and Coastal Change

The question of whether the state has the right to “take” (in the form of regulation) land in its coastal zones is a much more complex question that the courts, to date, have not been able to manage adequately. The problems faced along the coasts are difficult problems, and will likely not be settled by asking judges to determine the “rightness” of claims made through an adversarial process that tends to oversimplify situations in the process of constructing winnable legal arguments. Nor can we rely simply on administrative agencies or legislatures to protect the rights of individuals or protect them adequately from natural disasters. Clearly, the citizenry needs to be more active in these matters, and the administrative process needs to be both transparent and simplified. Quite frankly, it makes as much sense to have these cases drag out over decades as it does to have them framed in a way that oversimplifies the complex political challenges facing the governments attempting to regulate their coasts. The courts should stand ready to engage in oversight of these processes; but, if we can learn anything from Palazzolo, it may be that litigating with an overly simple goal of increasing private property rights could, in fact, only make matters more difficult because it will force the courts to continue muddling the waters of the takings clause. From a social science perspective, the longer the resolution, the more complicated and difficult the situation becomes. Prolonging the process into decades, then, is the last thing that should happen

Homological Product Codes

Quantum codes with low-weight stabilizers known as LDPC codes have been actively studied recently due to their simple syndrome readout circuits and potential applications in fault-tolerant quantum computing. However, all families of quantum LDPC codes known to this date suffer from a poor distance scaling limited by the square-root of the code length. This is in a sharp contrast with the classical case where good families of LDPC codes are known that combine constant encoding rate and linear distance. Here we propose the first family of good quantum codes with low-weight stabilizers. The new codes have a constant encoding rate, linear distance, and stabilizers acting on at most $\sqrt{n}$ qubits, where $n$ is the code length. For comparison, all previously known families of good quantum codes have stabilizers of linear weight. Our proof combines two techniques: randomized constructions of good quantum codes and the homological product operation from algebraic topology. We conjecture that similar methods can produce good stabilizer codes with stabilizer weight $n^a$ for any $a>0$. Finally, we apply the homological product to construct new small codes with low-weight stabilizers.Comment: 49 page

Infrared scanner Patent

Infrared scanning system for maintaining spacecraft orientation with earth referenc

Minimal kernels of Dirac operators along maps

Let $M$ be a closed spin manifold and let $N$ be a closed manifold. For maps $f\colon M\to N$ and Riemannian metrics $g$ on $M$ and $h$ on $N$, we consider the Dirac operator $D^f_{g,h}$ of the twisted Dirac bundle $\Sigma M\otimes_{\mathbb{R}} f^*TN$. To this Dirac operator one can associate an index in $KO^{-dim(M)}(pt)$. If $M$ is $2$-dimensional, one gets a lower bound for the dimension of the kernel of $D^f_{g,h}$ out of this index. We investigate the question whether this lower bound is obtained for generic tupels $(f,g,h)$

Electromagnetic mirror drive system

Oscillatory electromagnetic mirror drive system for horizon scanner

NT 500 Concise Greek

Course Description An introduction to exegetical Greek for ministry. Particular emphasis is placed on inductive learning of exegetical Greek, the use of standard exegetical tools and of Bible study software, and linguistics.https://place.asburyseminary.edu/syllabi/1200/thumbnail.jp

Binary Adaptive Semi-Global Matching Based on Image Edges

Image-based modeling and rendering is currently one of the most challenging topics in Computer Vision and Photogrammetry. The key issue here is building a set of dense correspondence points between two images, namely dense matching or stereo matching. Among all dense matching algorithms, Semi-Global Matching (SGM) is arguably one of the most promising algorithms for real-time stereo vision. Compared with global matching algorithms, SGM aggregates matching cost from several (eight or sixteen) directions rather than only the epipolar line using Dynamic Programming (DP). Thus, SGM eliminates the classical “streaking problem” and greatly improves its accuracy and efficiency. In this paper, we aim at further improvement of SGM accuracy without increasing the computational cost. We propose setting the penalty parameters adaptively according to image edges extracted by edge detectors. We have carried out experiments on the standard Middlebury stereo dataset and evaluated the performance of our modified method with the ground truth. The results have shown a noticeable accuracy improvement compared with the results using fixed penalty parameters while the runtime computational cost was not increased

IR 770 Senior Reflection Seminar

(1) To integrate insights from cross-cultural ministry experience with academic studies. (2) To explore with peers the biblical, theological and missiological implications of field experience for ministry in cross-cultural settings. (3) To form a community of faith and provide prayer support as students conclude their MA studies and move on to field assignments. (4) To review and evaluate the WME MA program and its effectiveness in preparing persons for their anticipated ministries.https://place.asburyseminary.edu/syllabi/1647/thumbnail.jp